Transcription groupies

On groupies in graphs

Groupies in multitype random graphs

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustr...

Groupies in Random Bipartite Graphs

A vertex of a graph G is called a groupie if its degree is not less than the arithmetic mean of the degrees of its neighbors. Some results concerning groupies have been obtained in deterministic graph theory; see e.g. [1, 5, 6]. Recently, Fernandez de la Vega and Tuza [3] investigate groupies in Erdős-Rényi random graphs G(n, p) and shows that the proportion of the vertices which are groupies i...

Down Regulation of DHFR Promoter Activity by PML Transcription Repressor

metabolic syndrome and mitochondrial transcription factor a